Approximation Algorithm for Maximum Cut
ثبت نشده
چکیده
منابع مشابه
An Approximation Algorithm for the Maximum Cut Problem 138
An approximation algorithm for Max Cut is designed and analyzed; its performances are experimentally compared with those of a neural algorithm and of the Goemans and Williamson's algorithm.
متن کامل2.1 Simple Approximation Algorithm
In this note, the cut C is referred as the cut-set and the size of the cut |C| as the size of the cut-set. For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the maximum cut problem. The problem is NP-hard. Simple 0.5approximation algorithms existed long time ago, but no improvement was made till 1990...
متن کاملApproximation Algorithms for Connected Maximum Cut and Related Problems
An instance of the Connected Maximum Cut problem consists of an undirected graph G = (V,E) and the goal is to find a subset of vertices S ⊆ V that maximizes the number of edges in the cut δ(S) such that the induced graph G[S] is connected. We present the first non-trivial Ω( 1 logn ) approximation algorithm for the Connected Maximum Cut problem in general graphs using novel techniques. We then ...
متن کاملCombinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is Θ(n log n) ; but the best combinatorial algorithms have approximation ratio 4/5 only, achieved in O(n) time [Bondy and Locke, J. Graph Theory 10 (1986), 477–504 ; and Halperin et al., J. Algorithms 53 (2004), 169–185]. Here we present ...
متن کاملA Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
We deal with the maximum cut problem on cubic graphs and we present a simple O(log n) time parallel algorithm, running on a CRCW PRAM with O(n) processors. The approximation ratio of our algorithm is 1.3̄ and improves the best known parallel approximation ratio, i.e. 2, in the special case of cubic graphs.
متن کامل